package Tree;

public class _669_TrimaBinarySearchTree {
    public TreeNode trimBST(TreeNode root, int L, int R) {
        if(root==null) return root;
        if (root.val > R) {
            return trimBST(root.left, L, R);
        } else if (root.val < L) {
            return trimBST(root.right, L, R);
        }
        root.left = trimBST(root.left, L, R);
        root.right = trimBST(root.right, L, R);
        return root;
    }
}
